Syntactic Monoids in a Category
نویسندگان
چکیده
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott (D “ sets), the syntactic semirings of Polák (D “ semilattices), and the syntactic associative algebras of Reutenauer (D = vector spaces). Assuming that D is an entropic variety of algebras, we prove that the syntactic D-monoid of a language L can be constructed as a quotient of a free D-monoid modulo the syntactic congruence of L, and that it is isomorphic to the transition D-monoid of the minimal automaton for L in D. Furthermore, in case the variety D is locally finite, we characterize the regular languages as precisely the languages with finite syntactic D-monoids. 1998 ACM Subject Classification F.4.3 Formal Languages
منابع مشابه
A Myhill-Nerode Theorem beyond Trees and Forests via Finite Syntactic Categories Internal to Monoids
The paper introduces recognizable languages as inverse images of sets of arrows from finite categories internal to monoids. The first result is the Myhill-Nerode Theorem as a conservative extension of the classic result for tree languages. The second result shows that a language of planar acyclic circuit diagrams whose gates have non-empty lists of input and output ports is recognizable if, and...
متن کاملLanguages and monoids with disjunctive identity.dvi
We show that the syntactic monoids of insertion-closed, deletionclosed and dipolar-closed languages are the groups. If the languages are insertionclosed and congruence simple, then their syntactic monoids are the monoids with disjunctive identity. We conclude with some properties of dipolarclosed languages.
متن کاملVarieties of Tree Languages Definable by Syntactic Monoids
An algebraic characterization of the families of tree languages definable by syntactic monoids is presented. This settles a question raised by several
متن کاملOrder-adjoint monads and injective objects
Given a monad T on Set whose functor factors through the category of ordered sets with left adjoint maps, the category of Kleisli monoids is defined as the category of monoids in the hom-sets of the Kleisli category of T. The Eilenberg-Moore category of T is shown to be strictly monadic over the category of Kleisli monoids. If the Kleisli category of T moreover forms an order-enriched category,...
متن کاملDescriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V of languages, a ∈ A being a letter. All such KaL’s generate the variety of languages BPol1(V ). We estimate the numerical parameters of the language KaL in terms of their values for K and L. These parameters include th...
متن کامل